Fast Endomorphism for any Genus 2 Hyperelliptic Curve over a Finite Field of Even Characteristic
نویسندگان
چکیده
In EUROCRYPT 2009, Galbraith, Lin and Scott constructed an efficiently computable endomorphism for a large family of elliptic curves defined over finite fields of large characteristic. They demonstrated that the endomorphism can be used to accelerate scalar multiplication in the elliptic curve cryptosystem based on these curves. In this paper we extend the method to any genus 2 hyperelliptic curve defined over a finite field of even characteristic. We propose an efficient algorithm to generate a random genus 2 hyperelliptic curve and its quadratic twist equipped with a fast endomorphism on the Jacobian. The analysis of the operation amount of the scalar multiplication is also given.
منابع مشابه
Families of Hyperelliptic Curves with Real Multiplication Familles de courbes hyperelliptiques à multiplications réelles
where bxc denotes the integer part of x. We say that a curve C of genus bn/2c, defined over a field k, has real multiplication by Gn if there exists a correspondence C on C such that Gn is the characteristic polynomial of the endomorphism induced by C on the regular differentials on C . The endomorphism ring of the Jacobian JC of such a curve C contains a subring isomorphic to Z[X ]/(Gn(X )) wh...
متن کاملAn Extension of Kedlaya's Algorithm to Artin-Schreier Curves in Characteristic 2
In this paper we present an extension of Kedlaya’s algorithm for computing the zeta function of an Artin-Schreier curve over a finite field Fq of characteristic 2. The algorithm has running time O(g log q) and needs O(g log q) storage space for a genus g curve. Our first implementation in MAGMA shows that one can now generate hyperelliptic curves suitable for cryptography in reasonable time. We...
متن کاملComputing Zeta Functions of Hyperelliptic Curves over Finite Fields of Characteristic 2
We present an algorithm for computing the zeta function of an arbitrary hyperelliptic curve over a finite field Fq of characteristic 2, thereby extending the algorithm of Kedlaya for small odd characteristic. For a genus g hyperelliptic curve over F2n , the asymptotic running time of the algorithm is O(gn) and the space complexity is O(gn).
متن کاملIsogenies and the Discrete Logarithm Problem on Jacobians of Genus 3 Hyperelliptic Curves
We describe the use of explicit isogenies to reduce Discrete Logarithm Problems (DLPs) on Jacobians of hyperelliptic genus 3 curves to Jacobians of non-hyperelliptic genus 3 curves, which are vulnerable to faster index calculus attacks. We provide algorithms which compute an isogeny with kernel isomorphic to (Z/2Z) for any hyperelliptic genus 3 curve. These algorithms provide a rational isogeny...
متن کاملEfficient Arithmetic on Genus 2 Hyperelliptic Curves over Finite Fields via Explicit Formulae
We extend the explicit formulae for arithmetic on genus two curves of [13, 21] to fields of even characteristic and to arbitrary equation of the curve. These formulae can be evaluated faster than the more general Cantor algorithm and allow to obtain faster arithmetic on a hyperelliptic genus 2 curve than on elliptic curves. We give timings for implementations using various libraries for the fie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2010 شماره
صفحات -
تاریخ انتشار 2010